Scheduling a Steel Plant with Timed Automata
نویسنده
چکیده
Scheduling in an environment with constraints of many different types is known to be a hard problem. We tackle this problem for an integrated steel plant in Ghent, Belgium, using UPPAAL, a model checker for networks of timed automata. We show how to translate schedulability to reachability, enabling us to use UPPAAL’s model checking algorithms.
منابع مشابه
Analyzing Real-Time Systems: Theory and Tools
The main topic of this dissertation is the development and use of methods for formal reasoning about the correctness of real-time systems, in particular methods and tools to handle new classes of problems. In real-time systems the correctness of the system does not only depend on the order in which actions take place, but also the timing of the actions. The formal reasoning presented here is ba...
متن کاملScheduling with timed automata
In this work we present timed automata as a natural tool for posing and solving scheduling problems. We show how efficient shortest path algorithms for timed automata can find optimal schedules for the classical job-shop problem. We then extend these results to synthesize adaptive scheduling strategies for problems with uncertainty in task durations.
متن کاملGuided Synthesis of Control Programs Using UPPAAL
In this paper we address the problem of scheduling and synthesizing distributed control programs for a batch production plant. We use a timed automata model of the batch plant and the verification tool UPPAAL to solve the scheduling problem. The plant model aims at faithfully reflecting the level of abstraction required for synthesizing control programs from generated timed traces. Therefore it...
متن کاملJob-Shop Scheduling Using Timed Automata
In this paper we show how the classical job shop scheduling problem can be modeled as a special class of acyclic timed automata Finding an optimal schedule corresponds then to nding a shortest in terms of elapsed time path in the timed automaton This representa tion provides new techniques for solving the optimization problem and more importantly it allows to model naturally more complex dynami...
متن کاملOn Nonlinear Prices in Timed Automata
Priced timed automata provide a natural model for quantitative analysis of real-time systems and have been successfully applied in various scheduling and planning problems. The optimal reachability problem for linearly-priced timed automata is known to be PSPACE-complete. In this paper we investigate priced timed automata with more general prices and show that in the most general setting the op...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999